AN O(n^2 log^2 n) ALGORITHM FOR INPUT-OR-OUTPUT TEST IN DISJUNCTIVE SCHEDULING
نویسندگان
چکیده
منابع مشابه
AN O(n log n) ALGORITHM FOR INPUT-OR-OUTPUT TEST IN DISJUNCTIVE SCHEDULING
of O(n log n) algorithm Step1(initial procedure) Initialize a binary tree BT . Step2(update procedure) If possible, update BT . Else, exit the algorithm. Step3(test procedure) Test candidate pairs of jobs. Go to Step2. Let Lpair(v) be a set of values fpair(i, j) of v. The initial procedure is below. Initial procedure Step1 Put indices to jobs so that d1 < d2 < · · · < dn. Step2 Construct a bina...
متن کاملAn O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
We present an O(n log log n/ log n) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n(log log n)/ log n) time.
متن کاملMixed Effects of Input Enhancement, Explicit Instruction, Corrective Feedback, and Pushed Output in an Input-Output Mapping Practice
This investigation examined the mixed effects of visual input enhancement, explicit instruction, pushed output, and corrective feedback on noticing and intake of English conjunctive adverbs. Participants included 83 intermediate EFL students enrolled in a grammar and writing course. They were assigned to a control group (n = 22), explicit instruction + pushed output + explicit corrective feedba...
متن کاملAn Õ(log2(N)) time primality test for generalized Cullen numbers
Generalized Cullen Numbers are positive integers of the form Cb(n) := nb n + 1. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is based in the following property of primes from this family: nb n ≡ (−1)b (mod nbn +1). It is stronger and has less computational cost than Fermat’s test (to b...
متن کاملAn Efficient Scheduling Algorithm for Input-queuing ATM Switches
In this paper, we propose and evaluate a three-phase scheduling algorithm for input-queuing ATMswitches, and we term it WRRLA algorithm. The WRRLA algorithm is an improvement over the conventional Weighted Round Robin (w . ) algorithm by simply combining it together with the Look Ahead (LA) technique. In a WRRLA scheduling operation, the WRR algorithm is first applied to schedule the timesensit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2004
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.47.112